A Gathering and Shooting Progressive Refinement Radiosity Method
نویسندگان
چکیده
This paper presents a gathering and shooting progressive refinement radiosity method. Our method integrates the iterative process of light energy gathering used in the standard full matrix method and the iterative process of light energy shooting used in the conventional progressive refinement method. As usual, in each iteration, the algorithm first selects the patch which holds the maximum unprocessed light energy in the environment as the shooting patch. But before the shooting process is activated, a light energy gathering process takes place. In this gathering process, the amount of the unprocessed light energy which is supposed to be shot to the current shooting patch from the rest of the environment in later iterations is pre-accumulated. In general, this extra amount of gathered light energy is far from trivial since it comes from every patch in the environment from which the current shooting patch can be seen. However, with the reciprocity relationship for formfactors, still only one hemi-cube of the form-factors is needed in each iteration step. Based on a concise record of the history of the unprocessed light energy distribution in the environment, a new progressive refinement algorithm with revised gathering and shooting procedures is then proposed. With little additional computation and memory usage compared to the conventional progressive refinement radiosity method, a solid convergence speedup is achieved. This gathering and shooting approach extends the capability of the radiosity method in accurate and efficient simulation of the global illuminations of complex environments. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-93-03. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/413 A Gathering and Shooting Progressive Refinement Radiosity Met hod MS-CIS-93-03 GRAPHICS LAB 52
منابع مشابه
Towards Optimal Combination of Shooting and Gathering Stochastic Radiosity
This paper deals with combination of shooting and gathering stochastic radiosity methods. The basic two-pass methods are reviewed and other new methods are proposed. The fundamental motivation for this paper is to develop an iterative two-pass stochastic radiosity that provides the progressive refinement feature of both types of radiosity algorithms. We want to give the user a new, better, solu...
متن کاملComputational Methods for Realistic Image Synthesis
Computational Methods for Realistic Image Synthesis Min-Zhi Shao Supervised by Dr. Norman I. Badler In this thesis, we investigate the computational methods for both diffuse and general reflections in realistic image synthesis and propose two new approaches: the overrelaxation solution and the Bernstein polynomial solution. One of the major concerns with the radiosity method is its expensive co...
متن کاملGathering Multi-path: a New Monte Carlo Algorithm for Radiosity
In this paper we present a new Monte Carlo technique for radiosity. This technique is shown to be the dual of the previous multi-path technique, in the same way as a gathering random walk technique is dual to a shooting one. We also show how the same global density of lines can be used to trace paths and thus to obtain estimators of radiosity simultaneously in both dual techniques. Although the...
متن کاملA parallel progressive radiosity algorithm based on patch data circulation
--Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrea,se the execution time, still excessive computational power is required for complex scenes. Hence, parallelism can be exploited for speeding up the method further. This paper aims at providing a thorough examination of parallelism in the ba...
متن کاملError and Complexity of Random Walk Monte Carlo Radiosity
In this paper, we study the error and complexity of the discrete random walk Monte Carlo technique for Radiosity, both the shooting and gathering methods. We show that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an 2(n log n) complexity. We give and c...
متن کامل